logic completeness造句

Another important problem in multiple - valued logic completeness theory is decision for sheffer functions , which reduced to determining the minimal covering of precomplete classes in multiple - valued logic
多值逻辑完备性理论中的另一重要问题是sheffer函数的判定问题，此问题可归结为定出所有极大封闭集(准完备集)的最小覆盖。
Followed the proving of validness of axioms is the proving of soundness and consistency for the negotiation logic . based on a series of propositions and lemmas , the completeness of the negotiation logic is proved by construction . then the logic completeness and the consistency of ctn system are presented
在对公理的有效性进行证明之后，证明了协商推理逻辑的可靠性和无矛盾性；在得出的一系列命题和引理基础上，以构造的方法证明了协商推理逻辑的完全性，最后得出协商推理逻辑的完备性和整个ctn系统的无矛盾性。
It's difficult to find logic completeness in a sentence. 用logic completeness造句挺难的